Flow Graphs and Data Mining
نویسنده
چکیده
In this paper we propose a new approach to data mining and knowledge discovery based on information flow distribution in a flow graph. Flow graphs introduced in this paper are different from those proposed by Ford and Fulkerson for optimal flow analysis and they model flow distribution in a network rather than the optimal flow which is used for information flow examination in decision algorithms. It is revealed that flow in a flow graph is governed by Bayes’ rule, but the rule has an entirely deterministic interpretation without referring to its probabilistic roots. Besides, a decision algorithm induced by a flow graph and dependency between conditions and decisions of decision rules is introduced and studied, which is used next to simplify decision algorithms.
منابع مشابه
تحلیل تراکنشهای امانت و گردش منابع کتابخانههای دانشگاه علوم پزشکی بیرجند با الگوریتمهای دادهکاوی
Introduction: Data mining is a process for discovering meaningful relationships and patterns from data. Identify behavior patterns of libraries users can helps improve decision-making in libraries. This study aimed to analyze the interlibrary loan transactions in Birjand University of Medical Sciences using data mining algorithms. Methods: In this descriptive study, knowledge discovery and d...
متن کاملDagma: Mining Directed Acyclic Graphs
We present how to efficiently mine a set of directed acyclic graphs (DAGs) for unconnected, both multior single-rooted, and induced fragments. With a new canonical form that is based on the nodes' topological levels, our miner is faster and uses less storage than general purpose gSpan (Yan, X. and Han, J., 2002). Moreover, it can base support resp. frequency either on the number of embeddings o...
متن کاملEvent Log Visualisation with Conditional Partial Order Graphs: from Control Flow to Data
Process mining techniques rely on event logs: the extraction of a process model (discovery) takes an event log as the input, the adequacy of a process model (conformance) is checked against an event log, and the enhancement of a process model is performed by using available data in the log. Several notations and formalisms for event log representation have been proposed in the recent years to e...
متن کامل– Miyamoto Musashi, in The Book of Five Rings. University of Alberta HEAVYWEIGHT PATTERN MINING IN ATTRIBUTED FLOW GRAPHS
Flow graphs are an abstraction used to represent elements traveling through a network of nodes. The paths between nodes are directed edges in the graph, and the amount or transmission frequency of elements that go through the paths are edge weights. If additional data is associated with the nodes, we have attributed flow graphs (AFGs). This thesis defines heavyweight patterns, which are sub-set...
متن کاملAlgorithmic graph theory
Introduction to graphs, Paths, cycles and trails Max-flow min-cut theorem, computing max s-t flows and min-cut Edge and Vertex Connectivity and Menger's theorem Maximum matching, Hall's theorem, algorithms for computing maximum matching in weighted and unweighted graphs. Edge and vertex colouring of graphs. Independent sets Planar graphs and algorithms for checking for planarity. The course nee...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005